Geometric medians in reconciliation spaces of phylogenetic trees

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric medians in reconciliation spaces

In evolutionary biology, it is common to study how various entities evolve together, for example, how parasites coevolve with their host, or genes with their species. Coevolution is commonly modelled by considering certain maps or reconciliations from one evolutionary tree P to another H, all of which induce the same map φ between the leaf-sets of P and H (corresponding to present-day associati...

متن کامل

Geometric medians

We discuss several generalizations of the notion of median to points in $R^d$. They arise in Computational Geometry and in Statistics. The notions are compared with respect to some of their mathematical properties. We also consider computational aspects. The issue of computational complexity raises several intriguing questions.

متن کامل

Kinetic Medians and kd-Trees

We propose algorithms for maintaining two variants of kd-trees of a set of moving points in the plane. A pseudo kd-tree allows the number of points stored in the two children to differ. An overlapping kd-tree allows the bounding boxes of two children to overlap. We show that both of them support range search operations in O(n) time, where 2 only depends on the approximation precision. When the ...

متن کامل

Computing Medians and Means in Hadamard Spaces

The geometric median as well as the Fréchet mean of points in a Hadamard space are important in both theory and applications. Surprisingly, no algorithms for their computation are hitherto known. To address this issue, we use a splitting version of the proximal point algorithm for minimizing a sum of convex functions and prove that this algorithm produces a sequence converging to a minimizer of...

متن کامل

Means and medians in nonlinear spaces

Until a few years ago, the majority of numerical techniques for optimization assumed an underlying Euclidean space. However, many of these computational problems are posed on non-Euclidean spaces. This motivates the development of new optimization methods that take into account the particular structure of the considered space. In this work, we focus on those spaces which can be seen as Riemanni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2018

ISSN: 0020-0190

DOI: 10.1016/j.ipl.2018.04.001